using System;class EuclidianAlgorithmForCDG{	static void Main()	{		//Write a program that calculates the greatest common divisor (GCD) of given two numbers.		//Use the Euclidean algorithm (find it in Internet).		Console.WriteLine("Euclidean algorithm that calculates the greatest common divisor (GCD) of given two numbers.\n Input a:");		uint a = uint.Parse(Console.ReadLine());		Console.WriteLine("b:");		uint b = uint.Parse(Console.ReadLine());		while(a!=0 && b!=0)		{			if(a>b)			{				Console.WriteLine("a={0} > b={1} then: a = {0} % {1} = {2}", a, b, a%b);				a= a % b;			}			else			{				Console.WriteLine("b={0} > a={1} then: b={0} % {1} = {2}", b,a,b%a);				b = b % a;			}			if(a==0)			{				Console.WriteLine("B={0} && A={1}",b,a);			}			else			{				Console.WriteLine("A={0} && B={1}",a,b);			}		}	}}